An Algorithm Derivative-Free to Improve the Steffensen-Type Methods

نویسندگان

چکیده

Solving equations of the form H(x)=0 is one most faced problem in mathematics and other science fields such as chemistry or physics. This kind cannot be solved without use iterative methods. The Steffensen-type methods, defined using divided differences are derivative free, usually considered to solve these problems when H a non-differentiable operator due its accuracy efficiency. However, general, accessibility methods small. main interest this paper improve set starting points that converge roots applying those So, by means predictor–corrector process we can accessibility. For this, predictor process, symmetric differences, with good then, corrector method, consider Center-Steffensen method quadratic convergence. In addition, dynamical studies presented show, an experimental way, also improves region Moreover, analyze semilocal convergence proposed two cases: differentiable non-differentiable. Summing up, present effective alternative for Newton’s operators, where applied. theoretical results illustrated numerical experiments.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the Dynamics of Steffensen-type Methods

The dynamics of Steffesen-type methods, using a graphical tool for showing the basins of attraction, is presented. The study includes as particular cases, Steffesen-type modifications of the Newton, the two-steps, the Chebyshev, the Halley and the super– Halley iterative methods. The goal is to show that if we are interesting to preserve the convergence properties we must ensure that the deriva...

متن کامل

extensions of some polynomial inequalities to the polar derivative

توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی

15 صفحه اول

An approach to Improve Particle Swarm Optimization Algorithm Using CUDA

The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...

متن کامل

Dynamics and Fractal Dimension of Steffensen-Type Methods

In this paper, the dynamical behavior of different optimal iterative schemes for solving nonlinear equations with increasing order, is studied. The tendency of the complexity of the Julia set is analyzed and referred to the fractal dimension. In fact, this fractal dimension can be shown to be a powerful tool to compare iterative schemes that estimate the solution of a nonlinear equation. Based ...

متن کامل

Ball Convergence for Steffensen-type Fourth-order Methods

We present a local convergence analysis for a family of Steffensen-type fourth-order methods in order to approximate a solution of a nonlinear equation. We use hypotheses up to the first derivative in contrast to earlier studies such as [1], [5]-[28] using hypotheses up to the fifth derivative. This way the applicability of these methods is extended under weaker hypotheses. Moreover the radius ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2021

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym14010004